We prove that every sufficiently big 6-connected graph of bounded tree-widtheither has a K_6 minor, or has a vertex whose deletion makes the graph planar.This is a step toward proving that the same conclusion holds for allsufficiently big 6-connected graphs. Jorgensen conjectured that it holds forall 6-connected graphs.
展开▼
